A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model
نویسندگان
چکیده
Article history: Received 2 September 2014 Received in revised form 20 November 2014 Accepted 29 November 2014 Available online 12 December 2014 Communicated by D.-Z. Du
منابع مشابه
Minimum Latency Aggregation Scheduling in Interference-Aware 3-Dimensional WSNs
In this paper, we study the Minimum Latency Aggregation Scheduling (MLAS) problem in Wireless Sensor Networks (WSNs) adopting the two interference models: the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR). The main issue of the MLAS problem is to compute schedules with the minimum number of timeslots, that is, to compute the mi...
متن کاملImproved minimum latency aggregation scheduling in wireless sensor networks under the SINR model
Wireless sensor networks are attracting much attention from the world and Minimum Latency Aggregation Scheduling(MLAS) has become one of the most significant fundamental problems in wireless sensor networks. However there are few results about efficient data aggregation algorithms under the Signal-to-Interference-plus-Noise-Ratio (SINR) model. In this paper, we propose a centralized algorithm t...
متن کاملMinimum Latency Link Scheduling for Arbitrary Directed Acyclic Networks under Precedence and SINR Constraints
Scheduling wireless links under the SINR model has attracted increasing attention in the past few years [1–6, 8–15, 18–20, 23–25, 27, 28, 33–36, 39, 41, 42, 45, 46]. However, most of previous work did not account for the precedence constraint that might exist among the wireless links. Precedence constraints are common in data aggregation problems where a sensor can not send data to its parent n...
متن کاملOn the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane∗
We show NP-hardness of the minimum latency scheduling (MLS) problem under the physical model of wireless networking. In this model a transmission is received successfully if the Signal to Interferenceplus-Noise Ratio (SINR), is above a given threshold. In the minimum latency scheduling problem, the goal is to assign a time slot and power level to each transmission, so that all the messages are ...
متن کاملData Aggregation Scheduling in Uncoordinated Duty-Cycled Wireless Sensor Networks under Protocol Interference Model
Data aggregation is a critical and widely-used operation in wireless sensor networks (WSNs). Data aggregation scheduling (DAS) aims to find an interference-free scheduling for data aggregation with the minimum latency. Most existing algorithms for the DAS problem, unfortunately, assume that nodes are always active, and hence are not suitable for dutycycled scenarios. In this paper, we investiga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 569 شماره
صفحات -
تاریخ انتشار 2015